A Parallel Version of the Unsymmetric Lanczos Algorithm and its Application to QMR
نویسندگان
چکیده
A new version of the unsymmetric Lanczos algorithm without look-ahead is described combining elements of numerical stability and parallel algorithm design. Firstly, stability is obtained by a coupled two-term procedure that generates Lanczos vectors scaled to unit length. Secondly, the algorithm is derived by making all inner products of a single iteration step independent such that global synchronization on parallel distributed memory computers is reduced. Among the algorithms using the Lanczos process as a major component, the quasi-minimal residual (QMR) method for the solution of systems of linear equations is illustrated by an elegant derivation. The resulting QMR algorithm maintains the favorable properties of the Lanczos algorithm while not increasing computational costs as compared with its corresponding original version.
منابع مشابه
An effective method for eigen-problem solution of fluid-structure systems
Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...
متن کاملEfficient Implementation of the Improved Unsymmetric Lanczos Process on Massively Distributed Memory Computers
For the eigenvalues of a large and sparse unsymmetric co-eecient matrix, we have proposed an improved version of the unsymmetric Lanczos process combining elements of numerical stability and parallel algorithm design. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner produc...
متن کاملThe Improved Unsymmetric Lanczos Process on Massively Distributed Memory Computers
|For the eigenvalues of a large and sparse unsym-metric coeecient matrix, we propose an improved version of the unsymmetric Lanczos process combining elements of numerical stability and parallel algorithm design. Stability is obtained by a coupled two-term recurrences procedure that generates Lanczos vectors scaled to unit length. The algorithm is derived such that all inner products and matrix...
متن کاملAn Implementation of the QMR Method Based on Coupled Two-Term Recurrences
Recently, the authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term rec...
متن کاملThe Non-Symmetric s-Step Lanczos Algorithm: Derivation Of Efficient Recurrences And Synchronization-Reducing Variants Of BiCG And QMR
The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on dist...
متن کامل